Fair Equivalence Relations

نویسندگان

  • Orna Kupferman
  • Nir Piterman
  • Moshe Y. Vardi
چکیده

Equivalence between designs is a fundamental notion in verification. The linear and branching approaches to verification induce different notions of equivalence. When the designs are modeled by fair state-transition systems, equivalence in the linear paradigm corresponds to fair trace equivalence, and in the branching paradigm corresponds to fair bisimulation. In this work we study the expressive power of various types of fairness conditions. For the linear paradigm, it is known that the Büchi condition is sufficiently strong (that is, a fair system that uses Rabin or Streett fairness can be translated to an equivalent Büchi system). We show that in the branching paradigm the expressiveness hierarchy depends on the types of fair bisimulation one chooses to use. We consider three types of fair bisimulation studied in the literature: bisimulation, game-bisimulation, and -bisimulation. We show that while gamebisimulation and -bisimulation have the same expressiveness hierarchy as tree automata, -bisimulation induces a different hierarchy. This hierarchy lies between the hierarchies of word and tree automata, and it collapses at Rabin conditions of index one, and Streett conditions of index two.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

FUZZY SUBGROUPS AND CERTAIN EQUIVALENCE RELATIONS

In this paper, we study an equivalence relation on the set of fuzzysubgroups of an arbitrary group G and give four equivalent conditions each ofwhich characterizes this relation. We demonstrate that with this equivalencerelation each equivalence class constitutes a lattice under the ordering of fuzzy setinclusion. Moreover, we study the behavior of these equivalence classes under theaction of a...

متن کامل

On certain semigroups of transformations that preserve double direction equivalence

Let TX be the full transformation semigroups on the set X. For an equivalence E on X, let TE(X) = {α ∈ TX : ∀(x, y) ∈ E ⇔ (xα, yα) ∈ E}It is known that TE(X) is a subsemigroup of TX. In this paper, we discussthe Green's *-relations, certain *-ideal and certain Rees quotient semigroup for TE(X).

متن کامل

THE CONNECTION BETWEEN SOME EQUIVALENCE RELATIONS ON FUZZY SUBGROUPS

This paper, deals with some equivalence relations in fuzzy subgroups. Further the probability of commuting two fuzzy subgroups of some finite abelian groups is defined.

متن کامل

ON THE COMPATIBILITY OF A CRISP RELATION WITH A FUZZY EQUIVALENCE RELATION

In a recent paper, De Baets et al. have characterized the fuzzytolerance and fuzzy equivalence relations that a given strict order relation iscompatible with. In this paper, we generalize this characterization by consideringan arbitrary (crisp) relation instead of a strict order relation, while payingattention to the particular cases of a reflexive or irreflexive relation. The reasoninglargely ...

متن کامل

Cardinality of Equivalence Relations

This entry provides formulae for counting the number of equivalence relations and partial equivalence relations over a finite carrier set with given cardinality. To count the number of equivalence relations, we provide bijections between equivalence relations and set partitions [4], and then transfer the main results of the two AFP entries, Cardinality of Set Partitions [1] and Spivey’s General...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2000